Algorithms with greedy heuristic procedures for mixture probability distribution separation
نویسندگان
چکیده
منابع مشابه
Probability-driven Greedy Algorithms for Set Cover
The Set Covering Problem (SCP) is one of the oldest, most common, and most studied NP–hard problems (Garey, Johnson, 1979) since it involves wide practical applications, e.g. showed that the performance ratio of this method is no worse than H(m), where H(m) = 1 + … + 1/m is the m-th harmonic number. This analysis of the greedy algorithm has remained essentially unchanged until Slavìk (1997) sta...
متن کاملGreedy Algorithms for Optimal Distribution Approximation
The approximation of a discrete probability distribution t by an M -type distribution p is considered. The approximation error is measured by the informational divergence D(t‖p), which is an appropriate measure, e.g., in the context of data compression. Properties of the optimal approximation are derived and bounds on the approximation error are presented, which are asymptotically tight. It is ...
متن کاملBubbleSearch: A simple heuristic for improving priority-based greedy algorithms
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority algorithms, which sequentially assign values to elements in some fixed or adaptively determined order. BubbleSearch extends priority algorithms by selectively considering additional orders near an initial good ordering. ...
متن کاملGreedy and Heuristic Algorithms for Codes and Colorings
Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is relatively small. With the motivation to improve lower bounds on the sizes of constant weight codes and asymmetric codes, we suggest a few greedy algorithms and other heuristic methods, which result in new, record-breaking codes. ...
متن کاملHeuristic Greedy Search Algorithms for Latent Variable Models
A Bayesian network consists of two distinct parts: a directed acyclic graph (DAG or belief-network structure) and a set of parameters for the DAG. The DAG in a Bayesian network can be used to represent both causal hypotheses and sets of probability distributions. Under the causal interpretation, a DAG represents the causal relations in a given population with a set of vertices V when there is a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2019
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor171107030k